منابع مشابه
Vertex-disjoint copies of K4- in graphs
Let K− 4 denote the graph obtained from K4 by removing one edge. Let k be an integer with k ≥ 2. Kawarabayashi conjectured that if G is a graph of order n ≥ 4k + 1 with σ2(G) ≥ n + k, then G has k vertex-disjoint copies of K− 4 . In this paper, we settle this conjecture affirmatively.
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملK4-free graphs with no odd holes
All K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about K4free graphs with no odd hole? They are not necessarily three-colourable, but we prove a conjecture of Ding that they are all four-colourable. This is a consequence of a decomposition theorem for such graphs; we prove that every such graph either has no odd antihole, or belongs to one of two explicitly...
متن کاملPrecoloring extension for K4-minor-free graphs
Let G = (V, E) be a graph where every vertex v ∈ V is assigned a list of available colors L(v). We say that G is list colorable for a given list assignment if we can color every vertex using its list such that adjacent vertices get different colors. If L(v) = {1, . . . , k} for all v ∈ V then a corresponding list coloring is nothing other than an ordinary k-coloring of G. Assume that W ⊆ V is a...
متن کاملK4-free Graphs as a Free Algebra
Graphs of treewidth at most two are the ones excluding the clique with four vertices (K4) as a minor, or equivalently, the graphs whose biconnected components are series-parallel. We turn those graphs into a finitely presented free algebra, answering positively a question by Courcelle and Engelfriet, in the case of treewidth two. First we propose a syntax for denoting these graphs: in addition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00353-k